Improved Approximations of Crossings in Graph Drawings and VLSI Layout Areas
نویسندگان
چکیده
منابع مشابه
Study of Neural Network Algorithm for Straight-Line Drawings of Planar Graphs
Graph drawing addresses the problem of finding a layout of a graph that satisfies given aesthetic and understandability objectives. The most important objective in graph drawing is minimization of the number of crossings in the drawing, as the aesthetics and readability of graph drawings depend on the number of edge crossings. VLSI layouts with fewer crossings are more easily realizable and con...
متن کاملA Parallel Approach to Row-Based VLSI Layout Using Stochastic Hill-Climbing
Parallel algorithms based on stochastic hill-climbing and parallel algorithms based on simple elements of a genetic algorithm for the one-sided bipartite crossing number problem, used in row-based vlsi layout, were investigated. These algorithms were run on a pvm cluster. The experiments show that the parallel approach does not bring faster computation but it does, however, much more importantl...
متن کاملImproved Bounds on the Crossing Number of Butterfly Network
The crossing number cr(G) of a graph G is the minimum number of crossings of its edges among all drawings of G in the plane. It is an important measure of the non-planarity of a graph [12], with applications in discrete and computational geometry [11]. The crossing number of a graph corresponding to the VLSI circuit has strong influence on the area layout as well as on the number of wire contac...
متن کاملArea - Universal and Constrained Rectangular
A rectangular layout is a partition of a rectangle into a finite set of interior-disjoint rectangles. These layouts are used as rectangular cartograms in cartography, as floorplans in building architecture and VLSI design, and as graph drawings. Often areas are associated with the rectangles of a rectangular layout and it is desirable for one rectangular layout to represent several area assignm...
متن کاملA Simulated Annealing Algorithm for the 2-page Crossing Number Problem
The simplest graph drawing method is that of putting the vertices of a graph on a line (spine) and drawing the edges as half-circles in κ half planes. Such drawings are called κ-page book drawings. Edge crossing minimisation is the most important goal in linear Very Large Scale Integration (VLSI) circuit design and Quantum-dot Cellular Automata (QCA), since a smaller number of crossings means l...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- SIAM J. Comput.
دوره 32 شماره
صفحات -
تاریخ انتشار 2002